The analysis of one-dimensional linear cellular automata and their aliasing properties

It is shown how to construct a general linear hybrid cellular automaton (CA) such that it h cycle, and how the aliasing properties of such automata compare with linear feedback sh when used as signature analyzers. The construction is accomplished by formally demons isomorphism which binds this kind of CA to the LFSRs. Consequently, these CAs can be machines. Linear algebraic techniques are then applied appropriately for the transformat search algorithm is developed which, given an irreducible characteristic polynomial, finds linear hybrid automaton. Such CAs are tabulated for all irreducible and primitive polynom plus a selection of others of higher degree. The behavior of a linear hybrid CA and that o LFSR are similar-that is, they have the same cycle structure and only relabel the states. properties, when they are used as signature analyzers, remain unchanged